Hierarchical low-rank structure of parameterized distributions
نویسندگان
چکیده
This note shows that the matrix forms of several one-parameter distribution families satisfy a hierarchical low-rank structure. Such distributions include binomial, Poisson, and $\chi^2$ distributions. The proof is based on uniform relative bound related divergence function. Numerical results are provided to confirm theoretical findings.
منابع مشابه
Parameterized Low-Rank Binary Matrix Approximation
We provide a number of algorithmic results for the following family of problems: For a given binary m × n matrix A and integer k, decide whether there is a “simple” binary matrix B which differs from A in at most k entries. For an integer r, the “simplicity” of B is characterized as follows. • Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete alre...
متن کاملMatrices with hierarchical low-rank structures
Matrices with low-rank off-diagonal blocks are a versatile tool to perform matrix compression and to speed up various matrix operations, such as the solution of linear systems. Often, the underlying block partitioning is described by a hierarchical partitioning of the row and column indices, thus giving rise to hierarchical low-rank structures. The goal of this chapter is to provide a brief int...
متن کاملLow Rank Perturbation of Jordan Structure
Let A be a matrix and λ0 be one of its eigenvalues having g elementary Jordan blocks in the Jordan canonical form of A. We show that for most matrices B satisfying rank (B) ≤ g, the Jordan blocks of A+B with eigenvalue λ0 are just the g− rank (B) smallest Jordan blocks of A with eigenvalue λ0. The set of matrices for which this behavior does not happen is explicitly characterized through a scal...
متن کاملRobust Low Rank Kernel Embeddings of Multivariate Distributions
Kernel embedding of distributions has led to many recent advances in machine learning. However, latent and low rank structures prevalent in real world distributions have rarely been taken into account in this setting. Furthermore, no prior work in kernel embedding literature has addressed the issue of robust embedding when the latent and low rank information are misspecified. In this paper, we ...
متن کاملLow-rank Matrix Factorization under General Mixture Noise Distributions
Many computer vision problems can be posed as learning a low-dimensional subspace from high dimensional data. The low rank matrix factorization (LRMF) represents a commonly utilized subspace learning strategy. Most of the current LRMF techniques are constructed on the optimization problems using L1-norm and L2-norm losses, which mainly deal with Laplacian and Gaussian noises, respectively. To m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2021
ISSN: ['1539-6746', '1945-0796']
DOI: https://doi.org/10.4310/cms.2021.v19.n3.a14